The WAC Journal, Vol. 13: JuneThe WAC Journal Teaching Audience Post-Process: Recognizing the Complexity of

Source URL: wac.colostate.edu

• Language
• Pedagogy
• Communication
• Literacy
• Teaching
• Writing Across the Curriculum
• Audience analysis
• Writing process
• Peter Elbow
• Writing
• Technical communication
• Education

The non-adaptive query complexity of testing k-parities

Source URL: cjtcs.cs.uchicago.edu

• Computational complexity theory
• Quantum information science
• Communication
• Communication complexity
• Quantum complexity theory
• Parity function
• Entropy
• Circuit complexity
• Decision tree model
• Theoretical computer science
• Applied mathematics
• Mathematics

The Cost of Fault Tolerance ∗ in Multi-Party Communication Complexity Binbin Chen Haifeng Yu

Source URL: www.comp.nus.edu.sg

• Binary trees
• Wireless networking
• Network topology
• Connectivity
• B-tree
• Breadth-first search
• Distributed computing
• Wireless sensor network
• Rope
• Theoretical computer science
• Computing
• Applied mathematics

Static Compilation Analysis for Host-Accelerator Communication Optimization Mehdi Amini1,2 , Fabien Coelho2 , François Irigoin2 and Ronan Keryell1 HPC Project, Meudon, France MINES ParisTech

Source URL: www.cri.ensmp.fr

• Computer hardware
• Complexity classes
• Video cards
• CUDA
• Nvidia
• NP
• OpenCL
• Graphics processing unit
• C
• GPGPU
• Computing
• Graphics hardware

Multiparty Computation for Interval, Equality, and Comparison without Bit-Decomposition Protocol Takashi Nishide1,2 and Kazuo Ohta1 1

Source URL: www.iacr.org

• Cryptographic protocols
• Secure multi-party computation
• IP
• Communication complexity
• Communications protocol
• FO
• Theoretical computer science
• Applied mathematics
• Cryptography

Efficient Set Operations in the Presence of Malicious Adversaries Carmit Hazay∗ Kobbi Nissim† May 4, 2010

Source URL: eprint.iacr.org

• Commitment scheme
• Zero-knowledge proof
• Oblivious transfer
• Secure two-party computation
• Proof of knowledge
• Communication complexity
• IP
• Polynomial
• Homomorphic encryption
• Cryptography
• Cryptographic protocols
• Secure multi-party computation

THE MESSAGE BOX A simple tool for communicating complexity The message box is a tool to help you organize your thoughts and identify key points. It is designed to be flexible – it can be used to help structure a presen

Source URL: origin.library.constantcontact.com

Case Study Chester Willcox & Saxbe reduces cost and complexity with secure remote access Chester Willcox & Saxbe

Source URL: l1.osdimg.com

• GoToMyPC
• GoToMeeting
• Gototraining
• GoToAssist
• Citrix Systems
• Citrix Online
• Remote access
• Web conferencing
• Remote desktop
• Computing
• Computer-mediated communication

ENTROPY OF OPERATORS OR WHY MATRIX MULTIPLICATION IS HARD FOR DEPTH-TWO CIRCUITS STASYS JUKNA Abstract. We consider unbounded fanin depth-2 circuits with arbitrary boolean functions as gates. We define the entropy of an

Source URL: lovelace.thi.informatik.uni-frankfurt.de

• Information theory
• Randomness
• Philosophy of thermal and statistical physics
• Quantum information science
• Entropy
• Circuit
• Boolean circuit
• Fourier transform
• Communication complexity
• Theoretical computer science
• Applied mathematics
• Computational complexity theory

Clique Problem, Cutting Plane Proofs and Communication Complexity✩ Stasys Jukna Institute of Computer Science, University of Frankfurt, Frankfurt a.M., Germany Institute of Mathematics and Informatics, Vilnius Universi

Source URL: lovelace.thi.informatik.uni-frankfurt.de

• NP-complete problems
• Clique
• Matching
• Maximal independent set
• Independent set
• Circuit complexity
• Path decomposition
• Bipartite dimension
• Graph theory
• Theoretical computer science
• Mathematics